A Polynomial Time Approximation Scheme for Dense MIN 2SAT
نویسندگان
چکیده
It is proved that everywhere-denseMin 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
منابع مشابه
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
The optimization problem Max-2SAT-CC is Max-2SAT with the additional cardinality constraint that the value one may be assigned to at most K variables. We present an approximation algorithm with polynomial running time for Max-2SAT-CC. This algorithm achieves, for any > 0, approximation ratio 6+3·e 16+2·e − ≈ 0.6603. Furthermore, we present a greedy algorithm with running time O(N logN) and appr...
متن کاملOn Approximation Hardness of the Minimum 2SAT-DELETION Problem
The Minimum 2SAT-Deletion problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems [8], and its approximability is largely open. We prove a lower approximation bound of 8 √ 5 − 15 ≈ 2.88854, improving the previous bound of 10 √ 5 − 21 ≈ 1.36067 by Dinur and Safra [5]. For h...
متن کاملApproximability of Dense Instances of NEAREST CODEWORD Problem
We give a polynomial time approximation scheme (PTAS) for dense instances of the Nearest Codeword problem.
متن کاملOn solving Boolean combinations of generalized 2SAT constraints
" is the maximum over the absolute values of constants appearing in the constraints. This solution bound improves over previously obtained bounds by an exponential factor. Our result enables a new enumerative approach to satisfiability checking. An experimental evaluation demonstrates the efficiency of this approach over previous techniques. As a corollary of our main result, we obtain a polyno...
متن کاملA Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs
Phylogenetic tree reconstruction is a fundamental biological problem. Quartet amalgamation combining a set of trees over four taxa into a tree over the full set stands at the heart of many phylogenetic reconstruction methods. This task has attracted many theoretical as well as practical works. However, even reconstruction from a consistent set of quartet trees, i.e. all quartets agree with some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999